A Proof-Producing CSP Solver

نویسندگان

  • Michael Veksler
  • Ofer Strichman
چکیده

PCS is a CSP solver that can produce a machine-checkable deductive proof in case it decides that the input problem is unsatisfiable. The roots of the proof may be nonclausal constraints, whereas the rest of the proof is based on resolution of signed clauses, ending with the empty clause. PCS uses parameterized, constraint-specific inference rules in order to bridge between the nonclausal and the clausal parts of the proof. The consequent of each such rule is a signed clause that is 1) logically implied by the nonclausal premise, and 2) strong enough to be the premise of the consecutive proof steps. The resolution process itself is integrated in the learning mechanism, and can be seen as a generalization to CSP of a similar solution that is adopted by competitive SAT solvers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A proof-producing CSP solver: A proof supplement

In [1] we described PCS, a CSP solver that can produce a machinecheckable deductive proof for an unsatisfiable input problem. This report supplements [1] in several ways: it provides soundness proof for the inference rules that were presented in Table 3; it provides proofs of correctness for several algorithms and claims; and, finally, it adds several missing algorithms and optimizations.

متن کامل

Basic Techniques for Creating an Efficient CSP Solver

Many computationally difficult problems from areas like planning and scheduling are easily modelled as constraint satisfaction problems (CSP). In order to have an uniform practical approach of these, a new programming paradigm emerged in the form of constraint programming, providing the opportunity of having declarative descriptions of CSP instances and also obtaining their solutions in reasona...

متن کامل

An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm

Constraint programming is gaining a great deal of attention because many combinatorial problems especially in areas of planning and scheduling can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a non-binary CSP can be transformed into an equivalent binary CSP using some of the actual techniques. However, when the CSP is not discrete or the number...

متن کامل

Sugar++: A SAT-Based MAX-CSP/COP Solver

This paper briefly describes some features of Sugar++, a SAT-based MAXCSP/COP solver entering the Third International CSP Solver Competition. In our approach, a MAX-CSP is translated into a Constraint Optimization Problem (COP), and then it is encoded into a SAT problem by the order encoding method [1]. SAT-encoded COP can be efficiently solved by repeatedly using the MiniSat solver [2]. The or...

متن کامل

MAS: An On-line Non-binary CSP Solver

Nowadays, many dynamic problems can be efficiently modelled as Constraint Satisfaction Problems (CSPs). These constraints may be on-line non-binary constraints that traditional CSP solver can not manage directly. It is well known that any non-binary CSP can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may not be practical in pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010